Method and apparatus for three-dimensional scene processing using parallax geometry of pairs of points

ABSTRACT

A method and apparatus for processing a geometric relationship between the image motion of pairs of points over multiple image frames representing a three-dimensional scene. This relationship is based on the parallax motion of points with respect to an arbitrary planar surface, and does not involve epipolar geometry. A constraint is derived over two frames for any pair of points, relating their projective structure (with respect to the plane) based only on their image coordinates and their parallax displacements. Similarly, a 3D-rigidity constraint between pairs of points over multiple frames is derived. Also disclosed are applications of these parallax-based constraints to solving three important problems in 3D scene analysis: (i) the recovery of 3D scene structure, (ii) the detection of moving objects in the presence of camera induced motion, and (iii) the synthesis of new camera views based on a given set of views. Moreover, this approach can handle difficult situations for 3D scene analysis, e.g., where there is only a small set of parallax vectors, and in the presence of independently moving objects.

This non-provisional U.S. national application, filed under 35 U.S.C. §111(a) claims, under 35 U.S.C. §119(e)(1), the benefit of the filing date of provisional U.S. application no. 60/011,524, filed under 35 U.S.C. §111(b) on Feb. 12, 1996.

FIELD OF THE INVENTION

The invention generally relates to image processing systems and, more particularly, to a method and apparatus for processing the parallax geometry of pairs of points within three-dimensional scene.

BACKGROUND OF THE INVENTION

The analysis of three dimensional scenes from image sequences has a number of goals. These goals include, but are not limited to: (i) the recovery of 3D scene structure, (ii) the detection of moving objects in the presence of camera induced motion, and (iii) the synthesis of new camera views based on a given set of views.

The traditional approach to these types of problems has been to first recover the epipolar geometry between pairs of frames and then apply that information to achieve the above-mentioned goals. However, this approach is plagued with the difficulties associated with the recovery of the epipolar geometry.

Recent approaches to 3D scene analysis have attempted to overcome some of the difficulties in recovering the epipolar geometry by decomposing the motion into a combination of a planar homography and residual parallax. The residual parallax motion depends on the projective structure, and the translation between the camera origins. While these methods remove some of the ambiguities in estimating camera rotation, they still require the explicit estimation of the epipole itself, which can be difficult under many circumstances. In particular, epipole estimation is ill-conditioned when the epipole lies significantly away from the center of the image and the parallax motion vectors are nearly parallel to each other. Also, when there are only a small number of parallax vectors and the scene contains moving objects, these objects incorrectly influence the estimation of the epipole.

In general, the treatment of multipoint geometry assumes that the scene is static and relies on the fact that almost all points selected for the shape estimation are known to belong to a single rigid body. In its current form, this class of methods has drawbacks, for example, these methods do not address the problem of shape recovery in dynamic scenes, in particular when the amount of image motion due to independent moving object is not negligible.

SUMMARY OF THE INVENTION

The present invention involves a technique for image processing which receives a plurality of two dimensional images representative of a scene, computes a parallax-related constraint for a pair of points within the plurality of images, applies the parallax-related constraint to a plurality of points within the plurality of images in order to generate information representative of whether a given point within the plurality of images is consistent with the parallax-related constraint; and uses the generated information for an image processing task related to the received plurality of images.

BRIEF DESCRIPTION OF THE DRAWINGS

The teachings of the present invention can be readily understood by considering the following detailed description in conjunction with the accompanying drawings in which:

FIG. 1 depicts a block diagram of a three-dimensional scene analysis system;

FIG. 2 provides a geometric illustration of the planar homography plus parallax decomposition;

FIG. 3 depicts a geometric illustration of a pairwise parallax constraint;

FIG. 4 depicts a geometric illustration of a scene where epipole estimation is unreliable, but the relative structure constraint can be reliably used to recover relative structure within the scene;

FIG. 5 depicts a flow diagram of a routine which utilizes the parallax constraint;

FIGS. 6 and 7 provide an illustration of parallax geometry and the dual of the epipole; and

FIGS. 8a-g depict a series of images used and produced during shape recovery that relies on a single parallax vector.

FIGS. 9a-b illustrates reliable detection of 3D motion inconsistency with sparse parallax information using a ball and tree.

FIGS. 10a-f are a series of images illustrating moving object detection relying on a single parallax vector.

FIGS. 11a-f are a series of images, like FIGS. 10a-f, illustrating moving object detection relying on a single parallax vector.

To facilitate understanding, identical reference numerals have been used, where possible, to designate identical elements that are common to the figures.

DETAILED DESCRIPTION Overview

The present invention uses, in various image processing tasks, the geometric relationships between the parallax displacements of two or more points within two or more images. The invention applies these relationships to various image processing tasks such as (i) the recovery of 3D scene structure, (ii) the detection of moving objects in the presence of camera induced motion, and (iii) the synthesis of new camera views based on a given set of views.

An important advantage of the present invention is the ability to effectively operate in difficult image processing situations (e.g., when there are a small number of parallax vectors, when the epipole estimation is ill-conditioned, and in the presence of moving objects). The present invention does not require the recovery of epipoles during processing; therefore, it applies to situations when the accurate recovery of the epipole is difficult. Moreover, the present techniques for 3D scene analysis are applicable when only a small set of parallax vectors is available. In fact, the planar parallax of a single point can be used as a reference to recover the structure of the entire scene, and to determine whether other points belong to the static scene or to a moving object.

The results presented herein are expressed in terms of the residual parallax displacements of points after canceling a planar homography. The decomposition of image motion into a homography plus parallax was shown to be more robust, yet more general, than the decomposition into rotation plus translation. Techniques for estimating the planar homography from pairs of images is described in J. R. Bergen, P. Anandan, K. J. Hanna, and R. Hingorani, “Hierarchical model-based motion estimation” European Conference on Computer Vision, pages 237-252, Santa Margarita Ligure, May 1992, which is herein incorporated by reference.

In the present invention, a parallax-based structure constraint is derived that relates the projective structure of two points to their image positions and their parallax displacements. By eliminating the relative projective structure of a pair of points between three frames, a constraint, referred to as the parallax-based rigidity constraint, on the parallax displacements of two points moving as a rigid object over those frames is derived.

Also presented below is an alternative way of deriving the parallax-based rigidity constraint. In the alternative derivation, the constraint is determined geometrically rather than algebraically. Doing so leads to a simple and intuitive geometric interpretation of the multiframe rigidity constraint and to the derivation of a dual point to the epipole.

Examples of applications of these parallax-based constraints to solving three important problems in 3D scene analysis are also described. The applications include: (i) the recovery of 3D scene structure, (ii) the detection of moving objects in the presence of camera induced motion, and (iii) the synthesis of new camera views based on a given set of views.

Finally, the generalization of the constraint to full image motion by including the planar homography component is described.

Exemplary Embodiment

Turning to the figures, FIG. 1 depicts a block diagram of a three-dimensional scene analysis system 100 suitable for implementing of the present invention. The system contains an image source 102, a computer system 104, one or more output devices 106 and one or more input devices 108. The image source 102 can be a video camera, an infrared camera, or some other sensor that generates a series of two-dimensional images representing a scene. Alternatively, the image source can be a storage device such as a video tape recorder, disk drive or some other means for storing sequential images representing a scene. The system generally processes digital images; therefore, if the image source produces analog images, a digitizer (not shown) is used between the image source and the computer system.

The general purpose computer 104 facilitates image processing, scene analysis and image display. Specifically, the computer system contains a data buffer 110, a central processing unit (CPUT) 112, support circuitry 114, random access memory (RAM) 116, read only memory (ROM) 118, and a display driver 120. Additionally, a user interacts with the computer system through one or more input devices 108 such as a keyboard, mouse, trackball, touchpad, and the like. Also, the computer systems displays the images and various graphical interface displays (screens) on the output display device 106 such as a computer monitor. Alternatively, the computer system may also interact with other output display devices such as a printer to provide a “hard copy” of any display that appears on the computer monitor.

The data buffer 110 provides data rate equalization (frame buffering) between the image source and the CPU. Typically, this buffer is a first-in, first-out (FIFO) buffer. Such buffers are typically used to provide a constant data rate to the CPU while providing flexibility in the data rates that can be generated by an image source.

The CPU 112 is typically a general purpose processor such as a PowerPC, Pentium, or some other generally available processor. PowerPC is a registered trademark of International Business Machines of Armonk, N.Y. and Pentium is a registered trademark of Intel Corporation of Santa Clara, Calif. Since the software implementation of the present invention is not required to execute on any specific processor, the routines of the present invention can be executed upon any type of processor or combination of processors in a parallel processing computer environment. In addition, rather than using a general purpose computer, the scene analysis may be accomplished within a real-time image processor.

The CPU 112 operates in conjunction with various other circuits such as RAM 116, ROM 118 and support circuitry 114 such as co-processor(s), clock circuits, cache, power supplies and other well-known circuits. The operation and interrelationship of these various computer components is well-known in the art and does not require further explanation. The display driver 120 may be a video card, printer driver or other common driver software or hardware as required by the output device(s) 106.

The RAM 116 stores the software implementation of the present invention. Typically, the routines of the invention are stored in a mass storage device (not shown) and recalled for temporary storage in the RAM 116 when executed by the CPU 112. In FIG. 1, the invention is embodied in a three-dimensional scene analysis routine 122.

A. Parallax-Based Constraints on Pairs of Points

A constraint on the parallax motion of pairs of points between two image frames that represent a three-dimensional scene as imaged by a video camera is described below. The derived constraint can be used to recover a relative 3D structure invariant of two points from their parallax vectors alone, without any additional information, and in particular, without requiring the recovery of the camera epipoles.

The parallax constraint is extended to multiple frames to form a rigidity constraint on any pair of image points (similar to the trilinear constraint). Namely, inconsistencies in the 3D motion of two points that belong to independently moving 3D objects can be detected based on their parallax displacements among three (or more) frames, without the need to estimate any 3D information.

To derive the parallax constraint, first, the decomposition of the image motion into a homography (i.e., the image motion of an arbitrary planar surface) and residual parallax displacements is described. This decomposition is well-known in the art.

1. The Planar Parallax Notations

FIG. 2 provides a geometric interpretation of the planar parallax. Let {right arrow over (P)}=(X,Y,Z)^(T) and {right arrow over (P)}¹=(X′,Y′,Z′)^(T) denote the Cartesian coordinates of a scene point with respect to different camera views, respectively. Let {right arrow over (x)}=(x,y)^(T) and {right arrow over (x)}′=(x′,y′)^(T) denote the corresponding coordinates of the scene point as projected onto the image planes at the two camera positions, respectively. Let $\overset{\rightarrow}{p} = {\left( {x,y,1} \right)^{T} = {{\frac{1}{Z}\overset{\rightarrow}{P}\quad {and}\quad {\overset{\rightarrow}{p}}^{\prime}} = {\left( {x^{\prime},y^{\prime},1} \right)^{T} = {\frac{1}{Z}{\overset{\rightarrow}{P}}^{\prime}}}}}$

denote the same point in homogeneous coordinates, respectively.

Let S be an arbitrary planar surface and A the homography that aligns the planar surface S between the second and first frame (i.e., for all points {right arrow over (P)}εS,{right arrow over (P)}=A′{right arrow over (P)}′). It can be shown that the image motion can be written (in homogeneous coordinates) as:

{right arrow over (p)}={right arrow over (p)} _(w) +k({right arrow over (p)} _(w) −{right arrow over (e)})  (1)

In FIG. 2, {right arrow over (p)}_(w) is the image point in the first frame which corresponds to warping {right arrow over (p)} by the homography ${A^{\prime}\text{:}{\overset{\rightarrow}{p}}_{w}} = \frac{A^{\prime}{\overset{\rightarrow}{p}}^{\prime}}{a_{3}^{\prime \quad T}\overset{\rightarrow}{p}}$

(a′₃ being the third row of A′). When {right arrow over (P)} is on the 3D planar surface S, then {right arrow over (p)}_(w)={right arrow over (P)}. Otherwise, the remaining displacement between {right arrow over (p)}_(w) and {right arrow over (p)} is proportional to the 3D projective structure (k) of {right arrow over (P)} with respect to the planar surface S. Also, ${k = {\frac{d_{N}}{Z}\frac{T_{Z}}{d^{\prime}}}},\quad {{{and}\quad \overset{\rightarrow}{e}} = {\frac{1}{T_{z}}\overset{\rightarrow}{T}}}$

is the epipole in the first frame. {right arrow over (T)}=(T_(X),T_(Y),T_(Z)) is the 3D translation between the two frames as expressed in the coordinate system of the first frame, d_(N) is the distance of {right arrow over (P)} from the plane S, and d′ is the distance to the plane from the second camera center.

Shape Invariance: Note that the projective structure k depends both on the 3D structure and on the camera translation {right arrow over (T)}. However $\frac{k_{1}}{k_{2}} = {\frac{d_{N1}}{d_{N2}}\frac{Z_{2}}{Z_{1}}}$

for any two points {right arrow over (P)}1 and {right arrow over (P)}2 is view-independent, and is therefore a relative structure invariant with respect to camera motion.

When T_(Z)=0, Eq. (1) can be rewritten in terms of {right arrow over (p)}_(w) as:

{right arrow over (p)}={right arrow over (p)} _(w)−τ{right arrow over (T)},  (2)

where $\tau = {\frac{d_{N}}{Z\quad d^{\prime}}.}$

Once again, $\frac{\tau_{1}}{\tau_{2}} = {\frac{d_{N1}}{d_{N2}}\frac{Z_{2}}{Z_{1}}}$

provides the same relative structure invariant.

Rewriting Eq. (1) in the form of image displacements yields, in homogeneous coordinates:

{right arrow over (p)}−{right arrow over (p)}=({right arrow over (p)}−{right arrow over (p)} _(w))−k({right arrow over (p)} _(w) −{right arrow over (e)}),  (3)

and in 2D image coordinates:

{right arrow over (u)}=({right arrow over (x)}′−{right arrow over (x)})=({right arrow over (x)}′−{right arrow over (x)} _(w))−k({right arrow over (x)} _(w) −{right arrow over (x)} _(e))={right arrow over (u)} _(π)+{right arrow over (μ)},  (4)

where {right arrow over (x)}=(x,y)^(T) signifies the image point where {right arrow over (p)}=(x,y,1)^(T) intersects the image plane of the first frame, {right arrow over (x)}_(e) signifies the 2D image coordinates of the epipole in the first fame, {right arrow over (μ)}_(π) denotes the planar part of the 2D image motion (the homography due to S), and {right arrow over (μ)} denotes the residual parallax 2D motion.

Similarly, when T_(Z)=0 (Eq. (2)):

{right arrow over (u)}=({right arrow over (x)}−′{right arrow over (x)})=({right arrow over (x)}−{right arrow over (x)} _(w))+τ{right arrow over (t)}={right arrow over (u)} _(π)+{right arrow over (μ)},  (5)

where t=(T_(X),T_(Y))^(T).

Eqs. (4) and (5) provide the form of parallax notation that will be used in the remaining of the paper. Note that they are expressed in terms of 2D image coordinates. Although we derived the parallax notation differently for T_(Z)=0 and T_(Z)≠0, they will be unified and treated as a single case in the following sections.

2. The Parallax-Based Structure Constraint

Let {right arrow over (x)}₁=(x₁,y₁) and {right arrow over (x)}₂=(x₂, x₂) be two image points. We start by analyzing the case when T_(Z)≠0. From Eq. (4) we have:

{right arrow over (μ)}₁ =x _({right arrow over (w)}) ₁ −{right arrow over (x)} ₁=κ₁({right arrow over (x)} _(e) −x _({right arrow over (w)}) ₁ )

{right arrow over (μ)}₂ =x _({right arrow over (w)}) ₂ −{right arrow over (x)} ₂=κ₂({right arrow over (x)} _(e) −x _({right arrow over (w)}) ₂ )  (6)

Let $\gamma = \frac{d_{N}}{Z\quad}$

denote the part of the projective structure κ which is point-dependent, i.e., $\kappa_{i} = {\gamma_{i}\frac{T_{z}}{d^{\prime}}}$

(i=1,2), then: $\begin{matrix} {{\overset{\rightarrow}{\mu}}_{1} = {\frac{T_{Z}}{d^{\prime}}{\gamma_{1}\left( {{\overset{\rightarrow}{x}}_{e} - x_{{\overset{\rightarrow}{w}}_{1}}} \right)}}} & (7) \\ {{\overset{\rightarrow}{\mu}}_{2} = {\frac{T_{Z}}{d^{\prime}}{\gamma_{2}\left( {{\overset{\rightarrow}{x}}_{e} - x_{{\overset{\rightarrow}{w}}_{2}}} \right)}}} & (8) \end{matrix}$

Therefore, $\begin{matrix} {{{{\overset{\rightarrow}{\mu}}_{1}\gamma_{2}} - {{\overset{\rightarrow}{\mu}}_{2}\gamma_{1}}} = {\gamma_{1}\gamma_{2}\frac{T_{Z}}{d^{\prime}}\left( {x_{{\overset{\rightarrow}{w}}_{2}} - x_{{\overset{\rightarrow}{w}}_{1}}} \right)}} & (9) \end{matrix}$

This last step eliminated the epipole {right arrow over (x)}_(e). Eq. (9) entails that the vectors on both sides of the equation are parallel. Since $\gamma_{1}\gamma_{2}\frac{T_{Z}}{d^{\prime}}$

is a scalar, we get:

({right arrow over (μ)}₁γ₂−{right arrow over (μ)}₂γ₁)|Δx _({right arrow over (w)}) _(2,1) ,

where Δx_({right arrow over (w)}) _(2,1) =(x_({right arrow over (w)}) ₂ −x_({right arrow over (w)}) ₁ ). This leads to the pairwise parallax constraint

({right arrow over (μ)}₁γ₂−{right arrow over (μ)}₂γ₁)^(T)(Δx _({right arrow over (w)}) _(2,1) )⊥=0,

where {right arrow over (ν)}_(⊥) signifies a vector perpendicular to {right arrow over (ν)}. From Eq. (6), x_({right arrow over (w)}) ₁ =({right arrow over (x)}_(i)+{right arrow over (μ)}_(i)),i=1,2. Hence, we can rewrite the parallax constraint in terms of the pixel coordinates of the two points and the parallax vectors as:

({right arrow over (μ)}₁γ₂−{right arrow over (μ)}₂γ₁)^(T)(Δx _({right arrow over (2)},1)+Δμ_({right arrow over (2)},1))_(⊥)=0,  (10)

where Δx_({right arrow over (2)},1)={right arrow over (x)}₂−{right arrow over (x)}₁, and Δμ_({right arrow over (2)},1)={right arrow over (μ)}₂−{right arrow over (μ)}₁.

Eq. (10) provides a constraint on the structure parameters (γ₁ and γ₂) of the two points, using only their image (pixel) coordinates and their parallax vectors.

γ₁ and γ₂ depend on the second-view. However, if {right arrow over (x)}₁ is chosen so that its parallax vector {right arrow over (μ)}₁≠0(i.e.,{right arrow over (P)}₁∉S), then the parallax constraint can be rewritten in terms of the relative structure invariant (with respect to the first frame) of the two points, $\begin{matrix} {{\frac{\gamma_{2}}{\gamma_{1}} = {\frac{d_{N1}}{d_{N2}}\frac{Z_{2}}{Z_{1}}\text{:}}}{{\left( {{{\overset{\rightarrow}{\mu}}_{1}\frac{\gamma_{2}}{\gamma_{1}}} - {\overset{\rightarrow}{\mu}}_{2}} \right)^{T}\left( {{\Delta \quad x_{\overset{\rightarrow}{2},1}} + {\Delta \quad \mu_{\overset{\rightarrow}{2},1}}} \right)_{\bot}} = 0}} & (11) \end{matrix}$

When T_(Z)=0, a constraint stronger than Eq. (11) can be derived: ${\left( {{{\overset{\rightarrow}{\mu}}_{1}\frac{\gamma_{2}}{\gamma_{1}}} - {\overset{\rightarrow}{\mu}}_{2}} \right) = 0},$

however, Eq. (11), still holds. This is important, as we do not have a prior knowledge of T_(Z) to distinguish between the two cases.

Therefore, given only the parallax vectors of the two image points, their relative structure $\frac{\gamma_{2}}{\gamma_{1}}$

can be recovered from Eq. (11): ${\frac{\gamma_{2}}{\gamma_{1}} = \frac{{{\overset{\rightarrow}{\mu}}_{2}^{T}\left( {{\Delta \quad x_{\overset{\rightarrow}{2},1}} + {\Delta \quad \mu_{\overset{\rightarrow}{2},1}}} \right)}_{\bot}}{{{\overset{\rightarrow}{\mu}}_{1}^{T}\left( {{\Delta \quad x_{\overset{\rightarrow}{2},1}} + {\Delta \quad \mu_{\overset{\rightarrow}{2},1}}} \right)}_{\bot}}},$

or more concisely, $\begin{matrix} {\frac{\gamma_{2}}{\gamma_{1}} = {\frac{{{\overset{\rightarrow}{\mu}}_{2}^{T}\left( {\Delta \quad x_{{\overset{\rightarrow}{w}2},1}} \right)}_{\bot}}{{{\overset{\rightarrow}{\mu}}_{1}^{T}\left( {\Delta \quad x_{{\overset{\rightarrow}{w}2},1}} \right)}_{\bot}}.}} & (12) \end{matrix}$

FIG. 3 displays the constraint geometrically. As shown in this figure, $\frac{\gamma_{2}}{\gamma_{1}} = \frac{A\quad C}{A\quad B}$

where AC and AB are defined in FIG. 3.

The benefit of the constraint in Eq. (12) is that it provides this information directly from the positions and parallax vectors of the two points, without the need to go through the computation of the epipole, using as much information as one point can give on another.

FIG. 4 graphically shows an example of a configuration in which estimating the epipole is very unreliable, whereas, estimating the relative structure directly from Eq. (12) is reliable.

3. The Parallax-Based Rigidity Constraint

In this section, how the parallax-based structure constraint can be extended to multiple frames, to form a rigidity constraint on pairs of image points that contains neither structure parameters nor camera geometry is described.

Rigidity Over Multiple Frames

Let {right arrow over (x)}₁=(x₁,y₁) and {right arrow over (x)}₂=(x₂,y₂) be two image points in the first (reference) frame.

Let {right arrow over (μ)}_(i) ^(j) denote the 2D planar parallax motion of {right arrow over (x)}_(i) from the first frame to frame j. From Eq. (6) we see that x_({right arrow over (w)}) _(i) ^(j) can be computed by {right arrow over (x)}_(i)+{right arrow over (μ)}_(i) ^(j),(i=1,2).

Using the structure invariance constraint of Eq. (12), for any two frames j and k we get: $\frac{\gamma_{2}}{\gamma_{1}} = {\frac{{{\overset{\rightarrow}{\mu}}_{2}^{j^{T}}\left( {\Delta \quad x_{{\overset{\rightarrow}{w}}_{2,1}}} \right)}_{\bot}^{j}}{{{\overset{\rightarrow}{\mu}}_{1}^{j^{T}}\left( {\Delta \quad x_{{\overset{\rightarrow}{w}}_{2,1}}} \right)}_{\bot}^{j}} = {\frac{{{\overset{\rightarrow}{\mu}}_{2}^{k^{T}}\left( {\Delta \quad x_{{\overset{\rightarrow}{w}}_{2,1}}} \right)}_{\bot}^{k}}{{{\overset{\rightarrow}{\mu}}_{1}^{k^{T}}\left( {\Delta \quad x_{{\overset{\rightarrow}{w}}_{2,1}}} \right)}_{\bot}^{k}}.}}$

Multiplying by the denominators yields the rigidity constraint of the two points over three frames (reference frame, frame j, and frame k):

({right arrow over (μ)}_(i) ^(k) ^(T) (Δx _({right arrow over (w)}) _(2,1) )_(⊥) ^(k))({right arrow over (μ)}₂ ^(j) ^(T) (Δx _({right arrow over (w)}) _(2,1) )_(⊥) ^(j))−({right arrow over (μ)}_(i) ^(j) ^(T) (Δx _({right arrow over (w)}) _(2,1) )_(⊥) ^(j))({right arrow over (μ)}₂ ^(k) ^(T) (Δx _({right arrow over (w)}) _(2,1) )_(⊥) ^(k))=0.  (13)

Based on the planar parallax motion trajectory of a single image point (e.g., {right arrow over (x)}₁) over several frames, the rigidity constraint (13) states a constraint on the planar parallax motion trajectory of any other point (e.g., {right arrow over (x)}₂) The rigidity constraint of Eq. (13) can therefore be applied to detect inconsistencies in the 3D motion of two image points (i.e., indicate whether the two image points are projections of 3D points belonging to a same or different 3D moving object) based on their parallax motion among three (or more) frames alone, without the need to estimate either camera geometry or structure parameters.

Rigidity Over Multiple Points

Instead of considering pairs of points over multiple frames, an alternative is to consider multiple points over two frames to come up with a different form of the rigidity constraint.

Let {right arrow over (x)}₁=(x₁,y₁),{right arrow over (x)}₂=(x₂,y₂), and {right arrow over (x)}₃=(x₃,y₃) be three image points in the first (reference) frame. Let {right arrow over (μ)}_(i) denote the 2D planar parallax motion of {right arrow over (x)}_(i) from the first frame to any other frame, and x{right arrow over (w)} _(i) ={right arrow over (x)}_(i)+{right arrow over (μ)}_(i),(i=1,2,3).

Using the shape invariance constraint of Eq. (12): ${\frac{\gamma_{2}}{\gamma_{1}} = \frac{{{\overset{\rightarrow}{\mu}}_{2}^{T}\left( {\Delta \quad x_{{\overset{\rightarrow}{w}}_{2,1}}} \right)}_{\bot}}{{{\overset{\rightarrow}{\mu}}_{1}^{T}\left( {\Delta \quad x_{{\overset{\rightarrow}{w}}_{2,1}}} \right)}_{\bot}}},{\frac{\gamma_{3}}{\gamma_{2}} = \frac{{{\overset{\rightarrow}{\mu}}_{3}^{T}\left( {\Delta \quad x_{{\overset{\rightarrow}{w}}_{3,2}}} \right)}_{\bot}}{{{\overset{\rightarrow}{\mu}}_{1}^{T}\left( {\Delta \quad x_{{\overset{\rightarrow}{w}}_{3,2}}} \right)}_{\bot}}},{\frac{\gamma_{3}}{\gamma_{1}} = \frac{{{\overset{\rightarrow}{\mu}}_{3}^{T}\left( {\Delta \quad x_{{\overset{\rightarrow}{w}}_{3,1}}} \right)}_{\bot}}{{{\overset{\rightarrow}{\mu}}_{1}^{T}\left( {\Delta \quad x_{{\overset{\rightarrow}{w}}_{3,1}}} \right)}_{\bot}}},$

Using the equality $\frac{\gamma_{3}}{\gamma_{1}} = {\frac{\gamma_{3}}{\gamma_{2}}\frac{\gamma_{2}}{\gamma_{1}}}$

and multiplying by the denominators, we get the rigidity constraint for three points over a pair of frames:

{right arrow over (μ)}₃ ^(T)(Δx _({right arrow over (w)}) _(3,2) )_(⊥){right arrow over (μ)}₂ ^(T)(Δx _({right arrow over (w)}) _(2,1) )_(⊥){right arrow over (μ)}₁ ^(T)(Δx _({right arrow over (w)}) _(3,1) )_(⊥) −{right arrow over (μ)} ₂ ^(T)(Δx _({right arrow over (w)}) _(3,2) )_(⊥){right arrow over (μ)}₁ ^(T)(Δx _({right arrow over (w)}) _(2,1) )_(⊥){right arrow over (μ)}₃ ^(T)(Δx _({right arrow over (w)}) _(3,1) )_(⊥)=0  (14)

The benefit of the rigidity constraint (14) is in the fact that it provides this information directly from the positions and parallax vectors of the three points, without the need to go through the unstable computation of the epipole, using as much information as two points can give on the third.

B. Parallax Geometry and an Epipole Dual

In this section, a different way of deriving the parallax-based rigidity constraint is described. Rather than deriving the constraint algebraically, the alternative derivation uses geometry. This leads to a simple and intuitive geometric interpretation of the multiframe rigidity constraint, and to the derivation of a dual point to the epipole. Although this distinct image point (the epipole dual) is pointed out, the rigidity constraint itself does not require the estimation of the dual epipole, just as it did not require the estimation of the epipole itself.

FIG. 6 illustrates the 3D geometric structure associated with the planar parallax of pairs of points between two frames. In this figure, S is the planar surface, and P and Q are the two scene points. As in the case of FIG. 2, P_(w) and Q_(w) are the intersections of rays O'P and O'Q with the plane S. Similarly, the points {right arrow over (p)}_(w) and {right arrow over (q)}_(w) on the reference image are the projections of P_(w) and Q_(w), and are therefore the points to which the planar homography transforms {right arrow over (p)}′ and {right arrow over (q)}′ respectively In other words, {right arrow over (p)}_(w)=A′{right arrow over (p)}′ and {right arrow over (q)}_(w)=A′{right arrow over (q)}′. Below, {right arrow over (p)}_(w) and {right arrow over (q)}_(w) are referred to as “warped points.”

Let R be the intersection of the line connecting P and Q with the plane S. Note that the points P, Q, R, P_(w) and Q_(w) are co-planar. Hence, P_(w) and Q_(w) and R are colinear. Of course, P, Q and R are colinear by constructions.

Let {right arrow over (r)} be the projection of R on the reference image plane. Since RεS,{right arrow over (r)}={right arrow over (r)}_(w). Since {right arrow over (p)},{right arrow over (q)},{right arrow over (r)} and {right arrow over (p)}_(w),{right arrow over (q)}_(w), {right arrow over (r)} are the image projection of the colinear warped points P, Q, R, we can infer the following: {right arrow over (p)}_(w), {right arrow over (q)}_(w) and {right arrow over (r)} and colinear and {right arrow over (p)},{right arrow over (q)} and {right arrow over (r)} are colinear.

In other words, the line connecting {right arrow over (p)}_(w) and {right arrow over (q)}_(w) and the line connecting {right arrow over (p)} and {right arrow over (q)} intersect at {right arrow over (r)}, the image of the point R.

Note that the point {right arrow over (r)} does not depend on the second camera view. Therefore, if multiple views are considered, then the lines connecting the warped points {right arrow over (p)}_(w) ^(j)=A^(j){right arrow over (p)}^(j) and {right arrow over (q)}_(w) ^(j)=A^(j){right arrow over (q)}^(j) (for any frame j), meet at {right arrow over (r)} for all such views.

FIG. 7 illustrates the convergence of the lines. Referring to that figure, since the lines qC, pB and rA are parallel to each other and intersect the lines qpr and CAB: $\frac{q\quad r}{p\quad r} = {\frac{C\quad A}{B\quad A} = {\frac{\gamma_{q}}{\gamma_{p}}.}}$

Similarly, $\frac{q\quad r}{p\quad r} = {\frac{F\quad D}{E\quad D} = {\frac{\gamma_{q}}{\gamma_{p}}.}}$

Hence $\frac{q\quad r}{p\quad r} = {\frac{C\quad A}{B\quad A} = {\frac{F\quad D}{E\quad D}.}}$

This is the same as the rigidity constraint derived in Eq. (13). Note, however, the rigidity constraint itself does not require the estimation of the point of convergence {right arrow over (r)}, just as it does not require the estimation of the epipole.

The point {right arrow over (r)} is the dual of the epipole: the epipole is the point of intersection of multiple parallax vectors between a pair of frames, i.e., the point of intersection of all lines connecting each image point with its warped point between a pair of frames. Whereas, the dual point {right arrow over (r)} is the point of intersection of all lines connecting a pair of points in the reference image and the corresponding pair of warped points from all other frames.

C. Applications Of Pairwise Parallax Geometry

In this section, how pairwise parallax geometry, in its various forms, provides an approach to handling some well-known problems in 3D scene analysis, in particular: (i) moving object detection, (ii) shape recovery, (iii) new view generation. It is shown that the parallax constraints provide the capability for solving these problems without having to first solve a “more complex” problem.

FIG. 5 depicts a flow diagram of a process for performing three-dimensional scene analysis which uses the shape constraint of Eq. (12) (or equivalently Eq. (11)) and the rigidity constraints of Eqs. (13) and (14). The process is represented as an executable software routine 500 that begins at step 502 and proceeds to step 504. At step 504, the routine is provided with a plurality of input images. At step 506, the routine computes a planar parallax motion (e.g., {right arrow over (μ)}₁) for each point in the image. Then, at step 508, for each motion trajectory determined in step 506, one or more of the constraints of Eqs. (11), (12), (13), and (14) are applied with respect to all other points. The routine 500 uses the information from step 508 (e.g., information representing some image points as being consistent with the constraint and some image points being inconsistent with the constraint) within one or more image processing tasks. These tasks include, but are not limited to, moving object detection (step 510), shape recovery (step 512, and new view generation (step 514). Each of these illustrative applications of the inventive technique are described below.

1. Estimating Planar Parallax Motion

The estimation of the planar parallax motion used for performing the experiments presented in this section was done using two successive computational steps: (i) 2D image alignment to compensate for a detected planar motion (i.e., the homography in the form of a 2D parametric transformation, and (ii) estimation of residual image displacements between the aligned images (i.e., the parallax). Such a system is disclosed in U.S. provisional patent application Ser. No. 60/011,496 filed Feb. 12, 1996 (Attorney Docket No. 12040) and herein incorporated by reference.

2. Shape Recovery

The parallax-based structure constraint (Eq. (12)) can be used to recover a 3D relative structure between pairs of points directly from their parallax vectors. This implies that the structure of the entire scene can be recovered relative to a single reference image point (with non-zero parallax). Singularities occur when the denominator of the constraint (Eq. (12)) tends to zero, i.e., for points that lie on the line passing through the reference point in the direction of its parallax vector.

FIGS. 8a-g show an example of recovering structure of an entire scene relative to a single reference point. Three views obtained by a hand-held camera of a rug covered with toy cars and boxes, were used as the source data whose heights were measured. The detected 2D planar motion was that of the rug (FIG. 8d). A single point with non-zero planar parallax was selected as a reference point for estimating relative shape (FIG. 8e). FIG. 8f shows the recovered relative structure of the entire scene from two frames (FIGS. 8b and 8 c). Regions close to the image boundary were ignored. The obtained results were quite accurate except along the singular line in the direction of the parallax of the reference point. The singular line is evident in FIG. 8f.

The singularities can be removed and the quality of the computed structure can be improved either by using multiple frames or by using multiple reference points:

Multiple frames: Singularities are removed by using multiple frames if their epipoles are non-colinear. Non-colinearity of epipoles can be detected through change in the parallax direction of the reference image point.

Multiple points: Singularities can be removed by using additional reference image points. An additional reference point should be chosen so that: (I) it does not lie on the singular line (i.e., in the direction of the parallax vector) of the first reference point (it should preferably be chosen on the line perpendicular to that), and (ii) the additional reference point should be first verified to move consistently with the first reference point through the rigidity constraint of Eq. (13) over a few frames.

Combinations of multiple reference points over multiple frames can also be used. FIG. 8g shows an example of recovering structure of an entire scene from three frames relative to the same single reference point as in FIG. 8f. The singular line in FIG. 8f has disappeared.

The ability to obtain relatively good structure information even with respect to a single point has several important virtues:

It does not require the estimation of the epipole., and therefore, does not require dense parallax information.

Unlike conventional techniques for recovering structure, it provides the capability to handle dynamic scenes, as it does not require having a collection of image points which is know a priori to belong to the single 3D moving object.

Since it relies on a single parallax vector, it provides a natural continuous way to bridge the gap between 2D cases, that assume only planar motion exists, and 3D cases that rely on having parallax data.

3. Moving Object Detection

A number of techniques exist to handle multiple motions analysis in the simpler 2D case, where motions of independent moving objects are modeled by 2D parametric transformation. These methods, however, detect points with planar parallax motion as moving objects, as they have a different 2D image motion than the planar part of the background scene.

In the general 3D case, the moving object detetion problem is much more complex, since it requires detecting 3D motion inconsistencies. Typically, this is done by recovering the epipolar geometry. Trying to estimate epipolar geometry (i.e., camera motion) in the presence of multiple moving objects, with no prior segmentation, is extremely difficult. This problem becomes even more acute when there exists only sparse parallax information.

FIG. 9a graphically displays an example of a configuration in which estimating the epipole in the presence of multiple moving objects can produce relatively large errors, even when using clustering techniques in the epipole domain as suggested by some conventional techniques. Relying on the epipole computation to detect inconsistencies in 3D motion fails in detecting moving objects in such cases.

In FIG. 9a, the camera is translating to the right. The only static object with pure parallax motion is that of the tree. The ball is falling independently. The epipole may be incorrectly computed as e. The false epipole e is consistent with both motions.

The parallax rigidity constraint (Eq. 13) can be applied to detect inconsistencies in the 3D motion of one image point relative to another directly from their “parallax” vectors over multiple (three or more) frames, without the need to estimate either camera geometry or shape parameters. This provides a useful mechanism for clustering (or segmenting) the “parallax” vectors (i.e., the residual motion after planar registration) into consistent groups belonging to consistently 3D moving objects even in cases such as in FIG. 9a where the parallax information is minimal and the independent motion is not negligible. FIG. 9b graphically illustrates how the rigidity constraint of Eq. (13), when applied, detects the 3D inconsistency over three frames.

FIGS. 10a-f shows an example of using the rigidity constraint of Eq. (13) to detect 3D inconsistencies. In this sequence, the camera is in motion (translating from left to right), inducing parallax motion of different magnitudes on the house, road, and road-sign. The car moves independently from left to right. The detected 2D planar motion was that of the house. The planar parallax motion was computed after 2D registration of the three images with respect to the house (FIG. 10d). A single point on the road-sign was selected as a point of reference (FIG. 10e). FIG. 10f displays the measure of inconsistency of each point in the image with respect to the selected road-sign point. Bright regions indicate large values when applying the constraint of Eq. (13) (i.e., violations in 3D rigidity detected over three frames with respect to the road-sign point). The region which was detected as moving 3D-inconsistently with respect to the road-sign point corresponds to the car. Regions close to the image boundary were ignored. All other regions of the image were detected as moving 3D-consistently with the road-sign point. Therefore, assuming an uncalibrated camera, this method provides a mechanism for segmenting all non-zero residual motion vectors (after 2D planar stabilization) into groups moving consistently (in the 3D sense).

FIG. 11a-f shows another example of using the rigidity constraint of Eq. (13) to detect 3D inconsistencies. In this sequence, the camera is mounted on a heliocopter flying from left to right, inducing some parallax motion (of different magnitudes) on the house-roof and trees (bottom of the image), and on the electricity poles (by the road). Three cars move independently on the road. The detected 2D planar motion was that of the ground surface (FIG. 11d). A single point was selected on a tree as a point of reference (FIG. 11e). FIG. 11f displays the measure of inconsistency of each point in the image with respect to the selected reference point. Bright regions indicate 3D-inconsistency detected over three frames. The three cars were detected as moving inconsistently with the selected tree point. Regions close to the image boundary were ingored. All other image regions were detected as moving consistenly with the selected tree point.

In the prior art, a rigidity constraint between three frames in the form of a trilinear tensor has been presented using regular image displacements. However, it requires having a collection of a set of image points which is known a priori to belong to the single 3D moving object. Selecting an inconsistent set of points leads to an erroneous tensor, and, hence, false moving object detection.

The ability of the parallax rigidity constraint of the present invention to detect 3D-inconsistency with respect to a single point, provides a natural way to bridge between 2D algorithms (which assume that any 2D motion different than the planar motion is an independently moving object), and 3D algorithms (which rely on having prior knowledge of a consistent set of points, or alternatively, dense parallax data).

4. New View Generation

This section describes an approach based on the parallax rigidity constraint for generating novel views using a set of “model” views.

Methods for generating new views based on recovering epipolar geometry are likely to be more noise sensitive than methods that generate the new view based on 2D information alone, i.e., without going from 2D through a 3D medium in order to reproject the information once again onto a new 2D image plane (the virtual view). The approach described below for new view generation does not require any epipolar geometry or shape estimation.

Given two “model” frames, planar parallax motion can be computed for all image points between the first (reference) frame and the second frame. An image point with non-zero parallax is selected, and a “virtual” parallax vector is defined for that point from the reference frame to the “virtual” frame to be generated. The rigidity constraint (Eq. 13) then specifies a single constraint on the virtual parallax motion of all other points from the reference frame to the virtual frame. Since each 2D parallax vector has two components (i.e., two unknowns), at least two “virtual” parallax vectors are needed to be specified in order to solve for all other virtual parallax vectors. Once the virtual parallax vectors are computed, the new virtual view can be created by warping the reference image twice: First, warping each image point by its computed virtual parallax. Then, globally warping the entire frame with a 2D virtual planar motion for the virtual homography.

Note that two virtual parallax vectors may not provide sufficient constraints for some image points. This is due to unfavorable location of those points in the image plane with respect to the two selected reference points and their parallax vectors. However, other image points, for whom the constraint was robust and sufficient to produce reliable virtual parallax, can be used (once their virtual parallax has been computed) as additional points to reliably constrain the virtual parallax of the singular points.

D. The Generalized Parallax Constraint

In this section, how the pairwise-parallax constraint (Eqs. (11, 12, 13, and 14)) can be extended to handle full image motion (as opposed to parallax motion), even when the homography is unknown, is described. This is useful for handling scenes that do not contain a physical planar surface. A form of a generalized parallax constraint between two frames in terms of the unknown homography parameters and the relative projective structure of pairs of points is described.

Eqs. (1) and (2) can be unified into a single form as: $\begin{matrix} {\overset{\rightarrow}{p} = {{{\overset{\rightarrow}{p}}_{w} + {\tau \quad \left( {{T_{Z}{\overset{\rightarrow}{p}}_{w}} - \overset{\rightarrow}{T}} \right)}} = {\frac{A^{\prime}{\overset{\rightarrow}{p}}^{\prime}}{a_{3}^{\prime \quad T}{\overset{\rightarrow}{p}}^{\prime}} + {\tau \left( {{T_{Z}\frac{A^{\prime}{\overset{\rightarrow}{p}}^{\prime}}{a_{3}^{\prime \quad T}{\overset{\rightarrow}{p}}^{\prime}}} - \overset{\rightarrow}{T}} \right)}}}} & (15) \end{matrix}$

where $\tau = {\frac{d_{N}}{Z\quad d^{\prime}} = {\gamma \frac{1}{d^{\prime}}}}$

(see notations above). A is an unknown homography from frame 2 to the first frame. It could relate to any planar surface in the scene, in particular a virtual plane. Importantly, before factoring out the structure, we first factor out the epipole, in a similar manner performed above.

Let {right arrow over (P)}₁ and {right arrow over (P)}₂ be two scene points with homogeneous coordinates {right arrow over (p)}₁ and {right arrow over (p)}₂. Then: ${\frac{1}{\tau_{1}}\left( {{\overset{\rightarrow}{p}}_{1} - \frac{A^{\prime}{\overset{\rightarrow}{p}}_{1}}{a_{3}^{\prime \quad T}{\overset{\rightarrow}{p}}_{1}^{\prime}}} \right)} = {{T_{Z}\frac{A^{\prime}{\overset{\rightarrow}{p}}_{1}^{\prime}}{a_{3}^{\prime \quad T}{\overset{\rightarrow}{p}}_{1}^{\prime}}} - \overset{\rightarrow}{T}}$ ${\frac{1}{\tau_{2}}\left( {{\overset{\rightarrow}{p}}_{2} - \frac{A^{\prime}{\overset{\rightarrow}{p}}_{2}}{a_{3}^{\prime \quad T}{\overset{\rightarrow}{p}}_{2}^{\prime}}} \right)} = {{T_{Z}\frac{A^{\prime}{\overset{\rightarrow}{p}}_{2}^{\prime}}{a_{3}^{\prime \quad T}{\overset{\rightarrow}{p}}_{2}^{\prime}}} - \overset{\rightarrow}{T}}$

Subtracting the two equations eliminates {right arrow over (T)}, yielding: $\begin{matrix} {{{\frac{1}{\tau_{1}}\left( {{\overset{\rightarrow}{p}}_{1} - \frac{A^{\prime}{\overset{\rightarrow}{p}}_{1}}{a_{3}^{\prime \quad T}{\overset{\rightarrow}{p}}_{1}^{\prime}}} \right)} - {\frac{1}{\tau_{2}}\left( {{\overset{\rightarrow}{p}}_{2} - \frac{A^{\prime}{\overset{\rightarrow}{p}}_{2}}{a_{3}^{\prime \quad T}{\overset{\rightarrow}{p}}_{2}^{\prime}}} \right)}} = {T_{Z}\left( {\frac{A^{\prime}{\overset{\rightarrow}{p}}_{1}^{\prime}}{a_{3}^{\prime \quad T}{\overset{\rightarrow}{p}}_{1}^{\prime}} - \frac{A^{\prime}{\overset{\rightarrow}{p}}_{2}^{\prime}}{a_{3}^{\prime \quad T}{\overset{\rightarrow}{p}}_{2}^{\prime}}} \right)}} & (16) \end{matrix}$

The equality (16) entails that the vectors on both sides of the equation are parallel, which leads to: ${\left( {{\frac{1}{\tau_{1}}\left( {{\overset{\rightarrow}{p}}_{1} - \frac{A^{\prime}{\overset{\rightarrow}{p}}_{1}}{a_{3}^{\prime \quad T}{\overset{\rightarrow}{p}}_{1}^{\prime}}} \right)} - {\frac{1}{\tau_{2}}\left( {{\overset{\rightarrow}{p}}_{2} - \frac{A^{\prime}{\overset{\rightarrow}{p}}_{2}}{a_{3}^{\prime \quad T}{\overset{\rightarrow}{p}}_{2}^{\prime}}} \right)}} \right)^{T}\left( {\frac{A^{\prime}{\overset{\rightarrow}{p}}_{1}^{\prime}}{a_{3}^{\prime \quad T}{\overset{\rightarrow}{p}}_{1}^{\prime}} - \frac{A^{\prime}{\overset{\rightarrow}{p}}_{2}^{\prime}}{a_{3}^{\prime \quad T}{\overset{\rightarrow}{p}}_{2}^{\prime}}} \right)_{\bot}} = 0.$

Multiplying both sides by τ₂ gives the generalized parallax constraint in terms the relative projective structure $\begin{matrix} {{{\text{~~~~}\frac{\tau_{2}}{\tau_{1}}} = {\frac{\gamma_{2}}{\gamma_{1}}\text{:}}}{{\left( {{\frac{\gamma_{2}}{\gamma_{1}}\left( {{\overset{\rightarrow}{p}}_{1} - \frac{A^{\prime}{\overset{\rightarrow}{p}}_{1}}{a_{3}^{\prime \quad T}{\overset{\rightarrow}{p}}_{1}^{\prime}}} \right)} - \left( {{\overset{\rightarrow}{p}}_{2} - \frac{A^{\prime}{\overset{\rightarrow}{p}}_{2}}{a_{3}^{\prime \quad T}{\overset{\rightarrow}{p}}_{2}^{\prime}}} \right)} \right)^{T}\left( {\frac{A^{\prime}{\overset{\rightarrow}{p}}_{1}^{\prime}}{a_{3}^{\prime \quad T}{\overset{\rightarrow}{p}}_{1}^{\prime}} - \frac{A^{\prime}{\overset{\rightarrow}{p}}_{2}^{\prime}}{a_{3}^{\prime \quad T}{\overset{\rightarrow}{p}}_{2}^{\prime}}} \right)_{\bot}} = 0.}} & (17) \end{matrix}$

The generalized parallax constraint (17) is expressed in terms of the homography A, the image coordinates of a pair of points in two frames, and the relative projective structure of the two points. The generalized constraint does not involve the epipoles.

The generalized parallax constraint suggests a new implicit representation of general 2D image motion: Rather than looking at the representation of 2D image motion in terms of: homography plus epipole plus projective structure, it suggests an implicit representation of 2D image motion in terms of homography plus relative projective structure of pairs of points. Since this representation does not contain the epipole, it can be easily extended to multiple frames.

Using Eq. (17), the invariant relative projective structure $\frac{\gamma_{2}}{\gamma_{1}}$

can be expressed explicitly in terms of the plane homography and the image positions of the two points in the two frames: $\begin{matrix} {\frac{\gamma_{2}}{\gamma_{1}} = \frac{\left( {{\overset{\rightarrow}{p}}_{2} - \frac{A^{\prime}p_{2}^{\overset{\rightarrow}{\prime}}}{a_{3}^{\prime \quad T}{\overset{\rightarrow}{p}}_{2}^{\prime}}} \right)^{T}\left( {\frac{A^{\prime}p_{1}^{\overset{\rightarrow}{\prime}}}{a_{3}^{\prime \quad T}p_{1}^{\overset{\rightarrow}{\prime}}} - \frac{A^{\prime}p_{2}^{\overset{\rightarrow}{\prime}}}{a_{3}^{\prime \quad T}p_{2}^{\overset{\rightarrow}{\prime}}}} \right)_{\bot}}{\left( {{\overset{\rightarrow}{p}}_{1} - \frac{A^{\prime}p_{1}^{\overset{\rightarrow}{\prime}}}{a_{3}^{\prime \quad T}{\overset{\rightarrow}{p}}_{1}^{\prime}}} \right)^{T}\left( {\frac{A^{\prime}p_{1}^{\overset{\rightarrow}{\prime}}}{a_{3}^{\prime \quad T}p_{1}^{\overset{\rightarrow}{\prime}}} - \frac{A^{\prime}p_{2}^{\overset{\rightarrow}{\prime}}}{a_{3}^{\prime \quad T}p_{2}^{\overset{\rightarrow}{\prime}}}} \right)_{\bot}}} & (18) \end{matrix}$

Since the computations are invariant to new camera positions, it can be factored out over multiple frames (j and k): ${\frac{\left( {{\overset{\rightarrow}{p}}_{2} - \frac{A^{\prime}p_{2}^{\prime \overset{\rightarrow}{\quad j}}}{a_{3}^{j^{T}}{\overset{\rightarrow}{p}}_{2}^{j}}} \right)^{T}\left( {\frac{A^{j}p_{1}^{\overset{\rightarrow}{j}}}{a_{3}^{j^{T}}p_{1}^{\overset{\rightarrow}{j}}} - \frac{A^{j}p_{2}^{\overset{\rightarrow}{j}}}{a_{3}^{j^{T}}p_{2}^{\overset{\rightarrow}{j}}}} \right)_{\bot}}{\left( {{\overset{\rightarrow}{p}}_{1} - \frac{A^{j}p_{1}^{\overset{\rightarrow}{j}}}{a_{3}^{j^{T}}p_{1}^{\overset{\rightarrow}{j}}}} \right)^{T}\left( {\frac{A^{j}p_{1}^{\overset{\rightarrow}{j}}}{a_{3}^{j^{T}}p_{1}^{\overset{\rightarrow}{j}}} - \frac{A^{j}p_{2}^{j}}{a_{3}^{j^{T}}p_{2}^{\overset{\rightarrow}{j}}}} \right)_{\bot}} = \frac{\left( {{\overset{\rightarrow}{p}}_{2} - \frac{A^{k}p_{2}^{\overset{\rightarrow}{k}}}{a_{3}^{k^{T}}{\overset{\rightarrow}{p}}_{2}^{k}}} \right)^{T}\left( {\frac{A^{k}p_{1}^{\overset{\rightarrow}{k}}}{a_{3}^{k^{T}}p_{1}^{\overset{\rightarrow}{k}}} - \frac{A^{k}p_{2}^{\overset{\rightarrow}{k}}}{a_{3}^{k^{T}}p_{2}^{\overset{\rightarrow}{k}}}} \right)_{\bot}}{\left( {{\overset{\rightarrow}{p}}_{1} - \frac{A^{k}p_{1}^{\overset{\rightarrow}{k}}}{a_{3}^{k^{T}}{\overset{\rightarrow}{p}}_{1}^{k}}} \right)^{T}\left( {\frac{A^{k}p_{1}^{\overset{\rightarrow}{k}}}{a_{3}^{k^{T}}p_{1}^{\overset{\rightarrow}{k}}} - \frac{A^{k}p_{2}^{k^{\prime}}}{a_{3}^{k^{T}}p_{2}^{\overset{\rightarrow}{k}}}} \right)_{\bot}}},$

which leads to a rigidity constraint of the form: $\begin{matrix} {{{\left( {{\overset{\rightarrow}{p}}_{2} - \frac{A^{\prime}p_{2}^{\prime \overset{\rightarrow}{\quad j}}}{a_{3}^{j^{T}}{\overset{\rightarrow}{p}}_{2}^{j}}} \right)^{T}\left( {\frac{A^{j}p_{1}^{\overset{\rightarrow}{j}}}{a_{3}^{j^{T}}p_{1}^{\overset{\rightarrow}{j}}} - \frac{A^{j}p_{2}^{\overset{\rightarrow}{j}}}{a_{3}^{j^{T}}p_{2}^{\overset{\rightarrow}{j}}}} \right)_{\bot}\left( {{\overset{\rightarrow}{p}}_{1} - \frac{A^{k}p_{1}^{\overset{\rightarrow}{k}}}{a_{3}^{k^{T}}{\overset{\rightarrow}{p}}_{1}^{k}}} \right)^{T}\left( {\frac{A^{k}p_{1}^{\overset{\rightarrow}{k}}}{a_{3}^{k^{T}}p_{1}^{\overset{\rightarrow}{k}}} - \frac{A^{k}p_{2}^{k^{\prime}}}{a_{3}^{k^{T}}p_{2}^{\overset{\rightarrow}{k}}}} \right)_{\bot}} - {\left( {{\overset{\rightarrow}{p}}_{2} - \frac{A^{k}p_{2}^{\overset{\rightarrow}{k}}}{a_{3}^{k^{T}}{\overset{\rightarrow}{p}}_{2}^{k}}} \right)^{T}\left( {\frac{A^{k}p_{1}^{\overset{\rightarrow}{k}}}{a_{3}^{k^{T}}p_{1}^{\overset{\rightarrow}{k}}} - \frac{A^{k}p_{2}^{\overset{\rightarrow}{k}}}{a_{3}^{k^{T}}p_{2}^{\overset{\rightarrow}{k}}}} \right)_{\bot}\left( {{\overset{\rightarrow}{p}}_{1} - \frac{A^{j}p_{1}^{\overset{\rightarrow}{j}}}{a_{3}^{j^{T}}p_{1}^{\overset{\rightarrow}{j}}}} \right)^{T}\left( {\frac{A^{j}p_{1}^{\overset{\rightarrow}{j}}}{a_{3}^{j^{T}}p_{1}^{\overset{\rightarrow}{j}}} - \frac{A^{j}p_{2}^{j}}{a_{3}^{j^{T}}p_{2}^{\overset{\rightarrow}{j}}}} \right)_{\bot}}} = 0.} & (19) \end{matrix}$

Eq. (19) is a rigidity constraint on a pair of points across three frames. Like the trilinear tensor of the prior art, it involves the parameters of two homographies across three frames. Unlike the trilinear tensor, it does not contain the epipole, but instead, is expressed on pairs of points.

The trilinear constraints are based on a initial reference points, and any additional point adds four linearly independent equations to constrain the unknowns of the tensor (which are combinations of the homography parameters and the epipoles).

In the generalized parallax rigidity constraint, the basis is a pair of points. Here also, any additional point adds four linearly independent rigidity constraints. These can be derived through factoring out T_(Z) from Eq. (16) with the additional third point (still within a pair of frames) to form the four linearly independent equations over three frames.

Although various embodiments which incorporate the teachings of the present invention have been shown and described in detail herein, those skilled in the art can readily devise many other varied embodiments that still incorporate these teachings. 

We claim:
 1. Method for image processing to detect a moving object comprising the steps of: a) receiving a plurality of two dimensional images representative of a scene, each image being taken at a respectively different time; b) computing a planar homography aligning a surface in the scene among the plurality of images; c) computing parallax vectors with respect to respective corresponding points in each of two images of the plurality of images; d) using the parallax vectors and additional information in the plurality of images, computing a parallax rigidity constraint for the plurality of images, the parallax rigidity constraint being independent of any epipole; e) applying the parallax rigidity constraint to a further plurality of points within the plurality of images in order to generate information representative of whether a given point within the plurality of images is consistent with the parallax rigidity constraint; and f) using the generated information to perform moving object detection related processing on the received plurality of images.
 2. The method of claim 1, wherein the parallax vectors are computed with respect to a pair of corresponding points in the two images and the additional information used to compute the parallax rigidity constraint is a pair of points in a third image of the plurality of images which corresponds to the pair of corresponding points in the two images.
 3. The method of claim 1, wherein the parallax vectors are computed with respect to a pair of corresponding points in the two images and the additional information used to compute the parallax rigidity constraint is a third corresponding point in each of the two images.
 4. Method for image processing to recover scene structure comprising the steps of: a) receiving a plurality of two dimensional images representative of a scene, wherein each image is taken from an arbitrary camera position; b) computing a planar homography aligning a surface in the scene among the plurality of images; c) computing parallax vectors with respect to respective corresponding points in each of two images of the plurality of images; d) using the parallax vectors and additional information in the plurality of images, computing a parallax rigidity constraint for the plurality of images, the parallax rigidity constraint being independent of any epipole; e) applying the parallax rigidity constraint to a further plurality of points within the plurality of images in order to generate information representative of whether a given point within the plurality of images is consistent with the parallax structure constraint; and f) using the generated information to perform recovery of scene structure related to the received plurality of images.
 5. Method for image processing to generate new views comprising the steps of: a) receiving a plurality of two dimensional images representative of a scene, each image taken from an arbitrary camera position; b) computing a planar homography aligning a surface in the scene among the plurality of images; c) computing parallax vectors with respect to respective corresponding points in each of two images of the plurality of images; d) using the parallax vectors and additional information in the plurality of images, computing a parallax rigidity constraint for the plurality of images, the parallax rigidity constraint being independent of any epipole; e) applying the parallax rigidity constraint to a further plurality of points within the plurality of images in order to generate information representative of whether a given point within the plurality of images is consistent with the parallax rigidity constraint; and f) using the generated information to perform new view generation related to and based on the received plurality of images.
 6. The method of claim 5, wherein the parallax vectors are computed with respect to a pair of corresponding points in the two images and the additional information used to compute the parallax rigidity constraint is a pair of points in a third image of the plurality of images which corresponds to the pair of corresponding points in the two images.
 7. The method of claim 5, wherein the parallax vectors are computed with respect to a pair of corresponding points in the two images and the additional information used to compute the parallax rigidity constraint is a third corresponding point in each of the two images.
 8. Apparatus for image processing comprising: a source of two dimensional images representative of a scene; a computer processor for processing the two dimensional images including: means for receiving a plurality of two dimensional images representative of a scene; means for computing a planar homography aligning a surface in the scene among the plurality of images; means for computing parallax vectors with respect to the planar homography of a plurality of points among the plurality of images; means for computing a parallax-related constraint directly from the positions of the plurality of points and the parallax vectors, the parallax-related constraint being independent of any epipole; means for applying the parallax-related constraint to a further plurality of points within the plurality of images in order to generate information representative of whether a given point within the plurality of images is consistent with the parallax-related constraint; means for using the generated information for an image processing task related to the received plurality of images and generating an output related thereto; and an output device for presenting the output of the image processing task.
 9. The apparatus of claim 8, wherein the source of images includes a video camera.
 10. The apparatus of claim 8, wherein the source of images includes an infra-red camera.
 11. The apparatus of claim 8, wherein the source of images includes a storage device.
 12. The apparatus of claim 11, wherein the storage device includes a video tape recorder.
 13. The apparatus of claim 11, wherein the storage device includes a disk drive.
 14. A computer-readable medium having stored thereon a plurality of instructions, the plurality of instructions including instructions which, when executed by a processor, cause the processor to perform the steps of: a) receiving, in digital form, a plurality of two dimensional images representative of a scene; b) computing a planar homography aligning a surface in the scene among the plurality of images; c) computing parallax vectors with respect to the planar homography for a plurality of points among the plurality of images; d) computing a parallax-related constraint directly from the positions of the plurality of points and the parallax vectors, the parallax-related constraint being independent of any epipole; e) applying the parallax-related constraint to a further plurality of points within the plurality of images in order to generate information representative of whether a given point within the plurality of images is consistent with the parallax-related constraint; and f) using the generated information for an image processing task related to the received plurality of images.
 15. The computer readable medium of claim 14, wherein the parallax-related constraint is a parallax structure constraint.
 16. The computer readable medium of claim 14, wherein the parallax-related constraint is a parallax rigidity constraint.
 17. The medium of claim 16, wherein the parallax vectors are computed with respect to a pair of corresponding points in the two images and the additional information used to compute the parallax rigidity constraint is a pair of points in a third image of the plurality of images which corresponds to the pair of corresponding points in the two images.
 18. The medium of claim 16, wherein the parallax vectors are computed with respect to a pair of corresponding points in the two images and the additional information used to compute the parallax rigidity constraint is a third corresponding point in each of the two images.
 19. Method for image processing comprising the steps of: a) receiving a plurality of two dimensional images representative of a scene, the images taken from arbitrary camera positions; b) computing a parallax-related constraint for a plurality of points within the plurality of images including the steps of: i) warping the plurality of images to compensate for effects of scaling and rotation around the camera positions; ii) computing parallax vectors for the plurality of points; and iii) computing the parallax-related constraint directly from the positions of the plurality of points and the parallax vectors, the parallax-related constraint being independent of any epipole; c) applying the parallax-related constraint to a further plurality of points within the plurality of images in order to generate information representative of whether a given point within the plurality of images is consistent with the parallax-related constraint; and d) using the generated information for an image processing task related to the received plurality of images. 